Learning automata based dynamic guard channel algorithms

نویسندگان

  • Hamid Beigy
  • Mohammad Reza Meybodi
چکیده

In this paper, we first propose two learning automata based decentralized dynamic guard channel algorithms for cellular mobile networks. These algorithms use learning automata to adjust the number of guard channels to be assigned to cells of network. Then, we introduce a new model for nonstationary environments under which the proposed algorithms work and study their steady state behavior when they use LR I learning algorithm. It is also shown that a learning automaton operating under the proposed nonstationary environment equalizes its penalty strengths. Computer simulations have been conducted to show the effectiveness of the proposed algorithms. The simulation results show that the performances of the proposed algorithms are close to the performance of guard channel algorithm that knows all the traffic parameters. 2011 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limited Fractional Guard Channel Algorithms : A Learning Automata Approach

In this paper, two learning automata based adaptive limited fractional guard channel algorithms for cellular mobile networks are proposed. These algorithms try to minimize the blocking probability of new calls subject to the constraint on the dropping probability of the handoff calls. To evaluate the proposed algorithms, computer simulation are conducted. The simulation results show that the pe...

متن کامل

earning automata based dynamic guard channel algorithms q

In this paper, we first propose two learning automata based decentralized dynamic guard channel algorithms for cellular mobile networks. These algorithms use learning automata to adjust the number of guard channels to be assigned to cells of network. Then, we introduce a new model for nonstationary environments under which the proposed algorithms work and study their steady state behavior when ...

متن کامل

A Learning Automata Based Dynamic Guard Channel Scheme

Dropping probability of handoff calls and blocking probability of new calls are two important QoS measures for cellular networks. Call admission policies, such as fractional guard channel and uniform fractional guard channel policies are used to maintain the pre-specified level of QoS. Since the parameters of network traffics are unknown and time varying, the optimal number of guard channels is...

متن کامل

Adaptive Uniform Fractional Channel Algorithms

Dropping probability of handoff calls and blocking probability of new calls are two important QoS measures for cellular networks. Since the dropping probability of handoff calls is more important, call admission policies are used to maintain the upper bound of dropping probability of handoff calls. The fractional guard channel policy (FG) is a general call admission policy and includes most pri...

متن کامل

An Adaptive Uniform Fractional Guard Channel Algorithm: A Learning Automata Approach

In [1], a learning automata (LA) based call admission policy is given which accepts new calls as long as the pre-specified level of QoS is maintained. The simulation results show that this policy cannot maintain the upper bound on the level of QoS. In this paper, we propose a new LA based algorithm in which a L-\ is used to accept/reject ne\v calls. This algorithm can be considered as an adapti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Electrical Engineering

دوره 37  شماره 

صفحات  -

تاریخ انتشار 2011